Fast matrix algebra for dense matrices with rank-deficient off-diagonal blocks
ثبت نشده
چکیده
All direct solvers described in this text make frequent use of matrix operations such as matrixmatrix multiplications, matrix inversions, LU factorizations, etc. The matrices that are manipulated are almost all dense, but fortunately, they will be either of small size, or will have internal structure that allows the required operations to be performed rapidly even though the matrices are dense. To be precise, the “internal structure” that is exploited is that off-diagonal blocks of the matrices can be well approximated by matrices of low rank. The chapter will illustrate the key ideas by introducing a very simple set of “compressible” matrices, and then showing how to rapidly perform algebraic operations on such compressible matrices.
منابع مشابه
A Fast Block Low-Rank Dense Solver with Applications to Finite-Element Matrices
1. Abstract. This article presents a fast dense solver for hierarchically off-diagonal low-rank (HODLR) matrices. This solver uses algebraic techniques such as the adaptive cross approximation (ACA) algorithm to construct the low-rank approximation of the off-diagonal matrix blocks. This allows us to apply the solver to any dense matrix that has an off-diagonal low-rank structure without any pr...
متن کاملMultiresolution Kernel Approximation for Gaussian Process Regression
(a) (b) (c) Figure: (a) In a simple blocked low rank approximation the diagonal blocks are dense (gray), whereas the off-diagonal blocks are low rank. (b) In an HODLR matrix the low rank off-diagonal blocks form a hierarchical structure leading to a much more compact representation. (c) H2 matrices are a refinement of this idea. (a) In simple blocked low rank approximation the diagonal blocks a...
متن کاملFast Sparse Selected Inversion 1285
We propose a fast structured selected inversion method for extracting the diagonal blocks of the inverse of a sparse symmetric matrix A, using the multifrontal method and rank structures. When A arises from the discretization of some PDEs and has a low-rank property (the intermediate dense matrices in the factorization have small off-diagonal numerical ranks), structured approximations of the d...
متن کاملRapid factorization of structured matrices via randomized sampling
Randomized sampling has recently been demonstrated to be an efficient technique for computing approximate low-rank factorizations of matrices for which fast methods for computing matrix vector products are available. This paper describes an extension of such techniques to a wider class of matrices that are not themselves rankdeficient, but have off-diagonal blocks that are. Such matrices arise ...
متن کاملA Fast Randomized Algorithm for Computing a Hierarchically Semiseparable Representation of a Matrix
Randomized sampling has recently been proven a highly efficient technique for computing approximate factorizations of matrices that have low numerical rank. This paper describes an extension of such techniques to a wider class of matrices that are not themselves rank-deficient, but have off-diagonal blocks that are; specifically, the class of so called Hierarchically Semi-Separable (HSS) matric...
متن کامل